\begin{tabbing}
$\forall$\=$i$:Id, ${\it ds}$:fpf(Id; $x$.Type), ${\it da}$:fpf(Knd; $k$.Type), $A$:ecl(${\it ds}$; ${\it da}$), ${\it snd}$:msg{-}spec(${\it ds}$; ${\it da}$),\+
\\[0ex]${\it upd}$:update{-}spec(${\it ds}$; ${\it da}$).
\-\\[0ex]update{-}spec{-}decl(${\it upd}$; ${\it ds}$)
\\[0ex]$\Rightarrow$ msg{-}spec{-}loc{-}decl(${\it snd}$; $i$; ${\it da}$)
\\[0ex]$\Rightarrow$ ($\neg$($\uparrow$fpf{-}dom(id{-}deq; mkid\{ecl:ut2\}; ${\it ds}$)))
\\[0ex]$\Rightarrow$ R{-}Feasible\=\{i:l\}\+
\\[0ex](ecl{-}machine\{ecl:ut2\}($i$; ${\it ds}$; ${\it da}$; $A$; ${\it snd}$; ${\it upd}$))
\-\\[0ex]$\Rightarrow$ \=($\forall$$a$:Id, ${\it ds}_{2}$:fpf(Id; $x$.Type), $T$:finite{-}prob{-}space, $P$:(decl{-}state(${\it ds}_{2}$)$\rightarrow\mathbb{B}$).\+
\\[0ex]($\neg$($\uparrow$fpf{-}dom(id{-}deq; mkid\{ecl:ut2\}; ${\it ds}_{2}$)))
\\[0ex]$\Rightarrow$ fpf{-}compatible(Id; $x$.Type; id{-}deq; ${\it ds}$; ${\it ds}_{2}$)
\\[0ex]$\Rightarrow$ ($\uparrow$fpf{-}dom(Kind{-}deq; locl($a$); ${\it da}$))
\\[0ex]$\Rightarrow$ (p{-}outcome($T$) = fpf{-}ap(${\it da}$; Kind{-}deq; locl($a$)) $\in$ Type)
\\[0ex]$\Rightarrow$ R{-}compat\=\{i:l\}\+
\\[0ex](ecl{-}machine\{ecl:ut2\}($i$; ${\it ds}$; ${\it da}$; $A$; ${\it snd}$; ${\it upd}$); Rpre($i$; ${\it ds}_{2}$; $a$; $T$; $P$)))
\-\-
\end{tabbing}